3 // Copyright (C) 2005, 2006, 2009 Free Software Foundation, Inc.
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the terms
7 // of the GNU General Public License as published by the Free Software
8 // Foundation; either version 3, or (at your option) any later
11 // This library is distributed in the hope that it will be useful, but
12 // WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 // General Public License for more details.
16 // Under Section 7 of GPL version 3, you are granted additional
17 // permissions described in the GCC Runtime Library Exception, version
18 // 3.1, as published by the Free Software Foundation.
20 // You should have received a copy of the GNU General Public License and
21 // a copy of the GCC Runtime Library Exception along with this program;
22 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
23 // <http://www.gnu.org/licenses/>.
25 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
27 // Permission to use, copy, modify, sell, and distribute this software
28 // is hereby granted without fee, provided that the above copyright
29 // notice appears in all copies, and that both that copyright notice
30 // and this permission notice appear in supporting documentation. None
31 // of the above authors, nor IBM Haifa Research Laboratories, make any
32 // representation about the suitability of this software for any
33 // purpose. It is provided "as is" without express or implied
37 * @file erase_fn_imps.hpp
38 * Contains an implementation for thin_heap_.
46 _GLIBCXX_DEBUG_ONLY(assert_valid();)
47 _GLIBCXX_DEBUG_ASSERT(!base_type::empty());
49 _GLIBCXX_DEBUG_ASSERT(m_p_max != NULL);
51 node_pointer p_nd = m_p_max;
55 base_type::actual_erase_node(p_nd);
57 _GLIBCXX_DEBUG_ONLY(assert_valid();)
75 node_pointer p_add = base_type::m_p_root;
77 while (p_add != m_p_max)
79 node_pointer p_next_add = p_add->m_p_next_sibling;
86 p_add = m_p_max->m_p_l_child;
90 node_pointer p_next_add = p_add->m_p_next_sibling;
92 p_add->m_metadata = p_add->m_p_l_child == NULL?
94 p_add->m_p_l_child->m_metadata + 1;
101 p_add = m_p_max->m_p_next_sibling;
103 while (p_add != NULL)
105 node_pointer p_next_add = p_add->m_p_next_sibling;
116 add_to_aux(node_pointer p_nd)
118 size_type r = p_nd->m_metadata;
120 while (m_a_aux[r] != NULL)
122 _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata < rank_bound());
124 if (Cmp_Fn::operator()(m_a_aux[r]->m_value, p_nd->m_value))
125 make_child_of(m_a_aux[r], p_nd);
128 make_child_of(p_nd, m_a_aux[r]);
138 _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata < rank_bound());
146 make_child_of(node_pointer p_nd, node_pointer p_new_parent)
148 _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata == p_new_parent->m_metadata);
149 _GLIBCXX_DEBUG_ASSERT(m_a_aux[p_nd->m_metadata] == p_nd ||
150 m_a_aux[p_nd->m_metadata] == p_new_parent);
152 ++p_new_parent->m_metadata;
154 base_type::make_child_of(p_nd, p_new_parent);
162 base_type::m_p_root = m_p_max = NULL;
164 const size_type rnk_bnd = rank_bound();
170 if (m_a_aux[i] != NULL)
172 make_root_and_link(m_a_aux[i]);
180 _GLIBCXX_DEBUG_ONLY(assert_aux_null();)
186 remove_node(node_pointer p_nd)
188 node_pointer p_parent = p_nd;
189 while (base_type::parent(p_parent) != NULL)
190 p_parent = base_type::parent(p_parent);
192 base_type::bubble_to_top(p_nd);
196 node_pointer p_fix = base_type::m_p_root;
197 while (p_fix != NULL&& p_fix->m_p_next_sibling != p_parent)
198 p_fix = p_fix->m_p_next_sibling;
201 p_fix->m_p_next_sibling = p_nd;
219 erase(point_iterator it)
221 _GLIBCXX_DEBUG_ONLY(assert_valid();)
222 _GLIBCXX_DEBUG_ASSERT(!base_type::empty());
224 node_pointer p_nd = it.m_p_nd;
228 base_type::actual_erase_node(p_nd);
230 _GLIBCXX_DEBUG_ONLY(assert_valid();)
234 template<typename Pred>
235 typename PB_DS_CLASS_C_DEC::size_type
239 _GLIBCXX_DEBUG_ONLY(assert_valid();)
241 if (base_type::empty())
243 _GLIBCXX_DEBUG_ONLY(assert_valid();)
248 base_type::to_linked_list();
250 node_pointer p_out = base_type::prune(pred);
254 while (p_out != NULL)
258 node_pointer p_next = p_out->m_p_next_sibling;
260 base_type::actual_erase_node(p_out);
265 node_pointer p_cur = base_type::m_p_root;
267 m_p_max = base_type::m_p_root = NULL;
269 while (p_cur != NULL)
271 node_pointer p_next = p_cur->m_p_next_sibling;
273 make_root_and_link(p_cur);
278 _GLIBCXX_DEBUG_ONLY(assert_valid();)
284 inline typename PB_DS_CLASS_C_DEC::size_type
288 const std::size_t* const p_upper =
289 std::upper_bound( g_a_rank_bounds, g_a_rank_bounds + num_distinct_rank_bounds, base_type::m_size);
291 if (p_upper == g_a_rank_bounds + num_distinct_rank_bounds)
294 return (p_upper - g_a_rank_bounds);